Some extremal problems on subordinate functions
نویسندگان
چکیده
منابع مشابه
Some Extremal Problems for Analytic Functions
The paper mainly concerns with functions f , analytic in S : |Imz| < 1 and bounded by a constant M > 1. We state sharp estimates for supR |f ′| under the additional condition supR |f | ≤ 1. Using these estimates we deduce well-known Bernstein’s inequality and some its generalizations for entire functions of a finite type with respect to an arbitrary proximate order. Parallely we investigate als...
متن کاملOn some extremal problems on r-graphs
Denote by G(r)(n ; k) an r-graph of n vertices and k r-tuples. TurLn’s classical problem states: Determine the smallest integer f(n ;r, I) so that every G(‘)(n ; f (n ; r, I)) contains a K(‘)(I). Turin determined f (n; r, I) for r = 2, but nothing is known for r > 2. Put lim,=., f (n ; r, l)/(y) = cr,l. The values of cr l are not known for r > 2. I prove that to every E > 0 and integer t there ...
متن کاملSOME EXTREMAL PROBLEMS ON r-GRAPHS
1 . Introduction . By an r-graph we mean a fixed set of vertices together with a class of unordered subsets of this fixed set, each subset containing exactly r elements and called an r-tuple . In the language of Berge [2j this is a simple uniform hypergraph of rank r . The concept becomes interesting only for r > 1 : for r = 2 we obtain ordinary (i .e ., Michigan) graphs . We shall represent an...
متن کاملOn some variations of extremal graph problems
A set P of graphs is termed hereditary property if and only if it contains all subgraphs of any graph G belonging to P. A graph is said to be maximal with respect to a hereditary property P (shortly P-maximal) whenever it belongs to P and none of its proper supergraphs of the same order has the property P. A graph is P-extremal if it has a the maximum number of edges among all P-maximal graphs ...
متن کاملSome Extremal Problems in Geometry
Continuing our work of [3] we obtain lower bounds on the number of simplices of different volumes and on the number of hyperplanes determined by n points in Ek , not all of which lie on an Ek-1 and no k of which lie on an Ek-2 . We also determine the minimum number of triangles t determined by n noncollinear points in the plane and discuss what values of t can be achieved . L . M . Kelly and 14...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Applied Mathematics Letters
سال: 2009
ISSN: 0893-9659
DOI: 10.1016/j.aml.2009.05.014